Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products

Disassembly is one of the most time-consuming and labor-intensive activities during value recovery end-of-life (EOL) products. The completion time (makespan) disassembling EOL products highly associated with allocation operators, especially in parallel disassembly. In this paper, asynchronous disassembly planning (APDP), which avoids necessity to synchronize tasks manipulators process, studied optimize task assignment for minimal makespan. We utilize four mixed integer linear programming (MILP) formulations identify optimal solutions. A set different-sized instances are used test compare performance proposed models, including some real-world cases. Finally, exact algorithm further compared existing approach solving APDP. Results indicate that a significant difference exists terms computational efficiency MILP while three can efficiently achieve better solutions than approach.